Approximation and convex decomposition by extremals in a $C^*$-algebra.
نویسندگان
چکیده
منابع مشابه
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
We revisit two NP-hard geometric partitioning problems – convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees. ∗[email protected] †[email protected] ‡[email protected] 1 ar X iv :1 40 4. 37 76 v1 [ cs .C G ] 1 ...
متن کاملFast Convex Decomposition for Truthful Social Welfare Approximation
Approximating the optimal social welfare while preserving truthfulness is a well studied problem in algorithmic mechanism design. Assuming that the social welfare of a given mechanism design problem can be optimized by an integer program whose integrality gap is at most α, Lavi and Swamy [1] propose a general approach to designing a randomized α-approximation mechanism which is truthful in expe...
متن کاملConvex Approximation by Quadratic Splines
Given a convex function f without any smoothness requirements on its derivatives, we estimate its error of approximation by C 1 convex quadratic splines in terms of ! 3 (f; 1=n).
متن کاملConvex Approximation by Spherical Patches
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...
متن کاملCharacterizations of extremals for some functionals on convex bodies
We investigate equality cases in inequalities for Sylvester-type functionals. Namely, it was proven by Campi, Colesanti and Gronchi that the quantity ∫ x0∈K ... ∫ xn∈K [V (conv{x0, ..., xn})]dx0...dxn , n ≥ d, p ≥ 1 is maximized by triangles among all planar convex bodies K (parallelograms in the symmetric case). We show that these are the only maximizers, a fact proven by Giannopoulos for p = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1997
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-12866